mirror of
				https://gitee.com/coder-xiaomo/leetcode-problemset
				synced 2025-11-01 02:03:12 +08:00 
			
		
		
		
	
		
			
				
	
	
		
			31 lines
		
	
	
		
			764 B
		
	
	
	
		
			HTML
		
	
	
	
	
	
			
		
		
	
	
			31 lines
		
	
	
		
			764 B
		
	
	
	
		
			HTML
		
	
	
	
	
	
| <p>Given two integers <code>left</code> and <code>right</code> that represent the range <code>[left, right]</code>, return <em>the bitwise AND of all numbers in this range, inclusive</em>.</p>
 | |
| 
 | |
| <p> </p>
 | |
| <p><strong class="example">Example 1:</strong></p>
 | |
| 
 | |
| <pre>
 | |
| <strong>Input:</strong> left = 5, right = 7
 | |
| <strong>Output:</strong> 4
 | |
| </pre>
 | |
| 
 | |
| <p><strong class="example">Example 2:</strong></p>
 | |
| 
 | |
| <pre>
 | |
| <strong>Input:</strong> left = 0, right = 0
 | |
| <strong>Output:</strong> 0
 | |
| </pre>
 | |
| 
 | |
| <p><strong class="example">Example 3:</strong></p>
 | |
| 
 | |
| <pre>
 | |
| <strong>Input:</strong> left = 1, right = 2147483647
 | |
| <strong>Output:</strong> 0
 | |
| </pre>
 | |
| 
 | |
| <p> </p>
 | |
| <p><strong>Constraints:</strong></p>
 | |
| 
 | |
| <ul>
 | |
| 	<li><code>0 <= left <= right <= 2<sup>31</sup> - 1</code></li>
 | |
| </ul>
 |